/*
 * @Author: your name
 * @Date: 2024-05-02 15:34:42
 * @LastEditTime: 2024-05-02 15:36:33
 * @LastEditors: your name
 * @Description: In User Settings Edit
 * @FilePath: \.leetcode\235.二叉搜索树的最近公共祖先.cpp
 */
/*
 * @lc app=leetcode.cn id=235 lang=cpp
 *
 * [235] 二叉搜索树的最近公共祖先
 */

// @lc code=start
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */

class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root->val > p->val && root->val > q->val){
            return lowestCommonAncestor(root->left, p, q);
        }else if(root->val < p->val && root->val < q->val){
            return lowestCommonAncestor(root->right, p ,q);
        }else{
            return root;
        }
    }
};
// @lc code=end

